An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms
نویسندگان
چکیده
We report on our experiments with ve graph drawing algorithms for general undirected graphs. These are the algorithms FR in-and Mehldau 6]. Implementations of these algorithms have been integrated into our GraphEd system 9]. We have tested these algorithms on a wide collection of examples and with diierent settings of parameters. Our examples are from original papers and by our own. The obtained drawings are evaluated both empirically and by GraphEd's evaluation toolkit. As a conclusion we can connrm the reported good behaviour of the algorithms. Combining time and quality we recommend to use GEM or KK rst, then FR and Tu and nally DH.
منابع مشابه
An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs
Abstract. In the last decade several algorithms that generate straightline drawings of general large graphs have been invented. In this paper we investigate some of these methods that are based on force-directed or algebraic approaches in terms of running time and drawing quality on a big variety of artificial and real-world graphs. Our experiments indicate that there exist significant differen...
متن کاملLarge-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are based on force-directed or algebraic approaches in terms of running time and drawing quality on a big variety of artificial and real-world graphs. Our experiments indicate that there exist significant differences in dr...
متن کاملSchool of IT Technical Report A FORCE-DIRECTED METHOD FOR LARGE CROSSING ANGLE GRAPH DRAWING
Recent empirical research has indicated that human graph reading performance improves when crossing angles increase. However, crossing angle has not been used as an aesthetic criterion for graph drawing algorithms so far. In this paper, we introduce a force-directed method that aims to construct graph drawings with large crossing angles. Experiments indicate that our method significantly increa...
متن کاملA Force-Directed Method for Large Crossing Angle Graph Drawing
Recent empirical research has indicated that human graph reading performance improves when crossing angles increase. However, crossing angle has not been used as an aesthetic criterion for graph drawing algorithms so far. In this paper, we introduce a force-directed method that aims to construct graph drawings with large crossing angles. Experiments indicate that our method significantly increa...
متن کاملAn Experimental Study on Distance-Based Graph Drawing
In numerous application areas, general undirected graphs need to be drawn, and force-directed layout appears to be the most frequent choice. We present an extensive experimental study showing that, if the goal is to represent the distances in a graph well, a combination of two simple algorithms based on variants of multi-dimensional scaling is to be preferred because of their efficiency, reliab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995